Partial S(k-1, k, v)'s inducing Pk-decompositions of Kv
نویسندگان
چکیده
Let Pk be the path with k vertices and k − 1 edges, k ≥ 4. For every integer v, v ≡ 0 or 1 (mod 2(k − 1)) if k is odd or v ≡ 0 or 1 (mod k−1) if k is even, we produce a Pk-design (V,B) of order v such that no two blocks have k − 1 or k common vertices, i.e. (V,B) is a partial S(k − 1, k, v). AMS classification: 05B05.
منابع مشابه
Indicator of $S$-Hausdorff metric spaces and coupled strong fixed point theorems for pairwise contraction maps
In the study of fixed points of an operator it is useful to consider a more general concept, namely coupled fixed point. Edit In this paper, by using notion partial metric, we introduce a metric space $S$-Hausdorff on the set of all close and bounded subset of $X$. Then the fixed point results of multivalued continuous and surjective mappings are presented. Furthermore, we give a positive resul...
متن کاملThe Analytic Class Number Formula and the Birch and Swinnerton-Dyer Conjecture
Let K be a number field, let OK be the ring of integers, let K be an algebraic closure of K and let OK be the ring of integers of K. Let M 0 K be the set of finite places and let M∞ K be the set of infinite places. Let Kv be the completion of K at v and let Ov be the ring of integers of Kv. Let ℘v, kv, qv be the maximal ideal of Ov, the residue field Ov/℘v and the size of the residue field |kv|...
متن کامل$k$-tuple total restrained domination/domatic in graphs
For any integer $kgeq 1$, a set $S$ of vertices in a graph $G=(V,E)$ is a $k$-tuple total dominating set of $G$ if any vertex of $G$ is adjacent to at least $k$ vertices in $S$, and any vertex of $V-S$ is adjacent to at least $k$ vertices in $V-S$. The minimum number of vertices of such a set in $G$ we call the $k$-tuple total restrained domination number of $G$. The maximum num...
متن کاملk-TUPLE DOMATIC IN GRAPHS
For every positive integer k, a set S of vertices in a graph G = (V;E) is a k- tuple dominating set of G if every vertex of V -S is adjacent to at least k vertices and every vertex of S is adjacent to at least k - 1 vertices in S. The minimum cardinality of a k-tuple dominating set of G is the k-tuple domination number of G. When k = 1, a k-tuple domination number is the well-studied domination...
متن کاملOn complementary path decompositions of the complete multigraph
We give a complete solution to the existence problem for complementary P3-decompositions of the complete multigraph, where P 3 denotes the path of length 3. A complementary decomposition 2>.K v (P 3 , P 3) is an edge decomposition of the complete multigraph >'Kv into P 3 '8 with the property that upon taking the complement of each path one obtains a second decomposition of >'K3 into P3 '8 (wher...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Australasian J. Combinatorics
دوره 35 شماره
صفحات -
تاریخ انتشار 2006